The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

0 CpxTRS
↳1 RenamingProof (⇔, 0 ms)
↳2 CpxRelTRS
↳3 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 typed CpxTrs
↳5 OrderProof (LOWER BOUND(ID), 0 ms)
↳6 typed CpxTrs
↳7 RewriteLemmaProof (LOWER BOUND(ID), 302 ms)
↳8 BEST
    ↳9 typed CpxTrs
        ↳10 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
        ↳11 typed CpxTrs
        ↳12 NoRewriteLemmaProof (LOWER BOUND(ID), 22 ms)
        ↳13 typed CpxTrs
        ↳14 LowerBoundsProof (⇔, 0 ms)
        ↳15 BOUNDS(n^1, INF)
    ↳16 typed CpxTrs
        ↳17 LowerBoundsProof (⇔, 0 ms)
        ↳18 BOUNDS(n^1, INF)

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
le, minus, quot

They will be analysed ascendingly in the following order:
le < minus
minus < quot

(6) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
le, minus, quot

They will be analysed ascendingly in the following order:
le < minus
minus < quot

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

Induction Base:
le(gen_0':s3_0(0), gen_0':s3_0(0)) →RΩ(1)
true

Induction Step:
le(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) →RΩ(1)
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) →IH
true

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
minus, quot

They will be analysed ascendingly in the following order:
minus < quot

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol minus.

(11) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
quot

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol quot.

(13) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(14) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

(15) BOUNDS(n^1, INF)

(16) Obligation:

TRS:
Rules:
le(0', Y) → true
le(s(X), 0') → false
le(s(X), s(Y)) → le(X, Y)
minus(0', Y) → 0'
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0'
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
minus :: 0':s → 0':s → 0':s
ifMinus :: true:false → 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n50)

(18) BOUNDS(n^1, INF)